Area Flexible GF(2k) Elliptic Curve Cryptography Coprocessor

Superscalar Coprocessor for High-Speed Curve-Based Cryptography

We propose a superscalar coprocessor for high-speed curvebased cryptography. It accelerates scalar multiplication by exploiting instruction-level parallelism (ILP) dynamically and processing multiple instructions in parallel. The system-level architecture is designed so that the coprocessor can fully utilize the superscalar feature. The implementation results show that scalar multiplication of ...

HW/SW Co-design for Accelerating Public-Key Cryptosystems over GF(p) on the 8051 μ-controller

Implementing large word-length public key algorithms on small 8-bit μ-controllers is a challenge. This paper presents a hardware/software co-design solution of RSA and Elliptic Curve Cryptography (ECC) over GF(p) on a 12 MHz 8-bit 8051 μ-controller. The hardware coprocessor has a modular arithmetic logic unit (MALU) of which the digit size (d) is variable. It can be adapted to the speed and ban...

High performance elliptic curve GF(2k) cryptoprocessor architecture for multimedia

Exploration of Design Space in ECDSA

The paper describes FPGA implementation of cryptographic coprocessor performing operations on elliptic curve points with coordinates in GF (2). Polynomial basis and normal basis arithmetic units are presented and compared. Hardware implementation of GCD inversion in polynomial basis is described. Where an optimal normal basis exists, the normal basis arithmetic performs better. The digit width ...

Fully Parameterizable Elliptic Curve Cryptography Processor over GF(2)

In this paper we present an Elliptic Curve Point Multiplication processor over base fields GF(2), suitable for use in a wide range of commercial cryptography applications. Our design operates in a polynomial basis is fully parameterizable in the irreducible polynomial and the chosen Elliptic Curve over any base Galois Field up to a given size. High performance is achieved by use of a dedicated ...